Scaling Limits for Random Quadrangulations of Positive Genus
نویسندگان
چکیده
منابع مشابه
Scaling Limits for Random Quadrangulations of Positive Genus
We discuss scaling limits of large bipartite quadrangulations of positive genus. For a given g, we consider, for every n≥ 1, a random quadrangulation qn uniformly distributed over the set of all rooted bipartite quadrangulations of genus g with n faces. We view it as a metric space by endowing its set of vertices with the graph distance. We show that, as n tends to infinity, this metric space, ...
متن کاملThe Topology of Scaling Limits of Positive Genus Random Quadrangulations
We discuss scaling limits of large bipartite quadrangulations of positive genus. For a given g, we consider, for every n ≥ 1, a random quadrangulation qn uniformly distributed over the set of all rooted bipartite quadrangulations of genus g with n faces. We view it as a metric space by endowing its set of vertices with the graph distance. As n tends to infinity, this metric space, with distance...
متن کاملOn the Sphericity of Scaling Limits of Random Planar Quadrangulations
We give a new proof of a theorem by Le Gall & Paulin, showing that scaling limits of random planar quadrangulations are homeomorphic to the 2-sphere. The main geometric tool is a reinforcement of the notion of Gromov-Hausdorff convergence, called 1-regular convergence, that preserves topological properties of metric surfaces.
متن کاملScaling Limit of Random Planar Quadrangulations with a Boundary
We discuss the scaling limit of large planar quadrangulations with a boundary whose length is of order the square root of the number of faces. We consider a sequence (σn) of integers such that σn/ √ 2n tends to some σ ∈ [0,∞]. For every n ≥ 1, we call qn a random map uniformly distributed over the set of all rooted planar quadrangulations with a boundary having n faces and 2σn half-edges on the...
متن کاملScaling limits of large random trees
The goal of these lectures is to survey some of the recent progress on the description of largescale structure of random trees. We will use the framework of Markov branching sequences of trees and develop several applications, to combinatorial trees, Galton-Watson trees, some dynamical models of randomly growing trees, cut trees, etc. This is a rough draft – to be completed – all comments are w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2010
ISSN: 1083-6489
DOI: 10.1214/ejp.v15-810